Polynomial-size vectors are enough for the unimodular triangulation of simplicial cones
نویسندگان
چکیده
In a recent paper, Bruns and von Thaden established bound for the length of vectors involved in unimodular triangulation simplicial cones. The is exponential square logarithm multiplicity, improves previous bounds significantly. this paper we will prove that bound, which polynomial multiplicity ?, exists. detail, type ?f(d) with f(d)?O(d).
منابع مشابه
Unimodular triangulations of simplicial cones by short vectors
Article history: Received 23 January 2016 Available online xxxx
متن کاملOn Completing Unimodular Polynomial Vectors of Length Three
It is shown that if R is a local ring of dimension three, with ¿ € R , then a polynomial three vector (vQ(X), vx(X), v2(X)) over R[X] can be completed to an invertible matrix if and only if it is unimodular. In particular, if 1/3! € J! , then every stably free projective R[XX, ... , .Y„]-module is free.
متن کاملA New Triangulation for Simplicial Algorithms
Triangulations are used in simplicial algorithms to nd the xed points of continuous functions or upper semi-continuous mappings; applications arise from economics and optimization. The performance of simplicial algorithms is very sensitive to the triangulation used. Using a facetal description, we modify Dang's D 1 triangulation to obtain a more eecient triangulation of the unit hypercube in R ...
متن کاملf - vectors of simplicial posets that are balls
Results of R. Stanley and M. Masuda completely characterize the hvectors of simplicial posets whose order complexes are spheres. In this paper we examine the corresponding question in the case where the order complex is a ball. Using the face rings of these posets, we develop a series of new conditions on their h-vectors. We also present new methods for constructing poset balls with specific h-...
متن کاملSimplicial arrangements on convex cones
We introduce the notion of a Tits arrangement on a convex open cone as a special case of (infinite) simplicial arrangements. Such an object carries a simplicial structure similar to the geometric representation of Coxeter groups. The standard constructions of subarrangements and restrictions, which are known in the case of finite hyperplane arrangements, work as well in this more general settin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2021
ISSN: ['0097-3165', '1096-0899']
DOI: https://doi.org/10.1016/j.jcta.2021.105421